The Positivity Set of a Recurrence Sequence
نویسندگان
چکیده
We consider real sequences (fn) that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive dominating characteristic root, we establish that the density is positive. Furthermore, we determine the values that can occur as density of such a positivity set, both for the special case just mentioned and in general.
منابع مشابه
Toeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملOn the Positivity Problem for Simple Linear Recurrence Sequences,
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.
متن کاملRecurrence relations versus succession rules
In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently studied tool for the enumeration of combinatorial objects related to the ECO method. We also discuss the applicability of our method as a test for the positivity ...
متن کاملDetermining the correlated factors of breast cancer recurrence by Poisson Beta-Weibull non- mixture cure model
Introduction: Therapies for many of diseases, especially cancer, have been improved significantly in the recent years, resulting in an increase in the number of patients who do not experience mortality. Therefore, the application of cure models is more suitable for survival analysis in this population than the usual survival models are. The aim of this study was to estimate the recurrence-free ...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل